The triangular decomposition of Hankel matrices

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Triangular Decomposition of Matrices in a Domain

Deterministic recursive algorithms for the computation of matrix triangular decompositions with permutations like LU and Bruhat decomposition are presented for the case of commutative domains. This decomposition can be considered as a generalization of LU and Bruhat decompositions, because they both may be easily obtained from this triangular decomposition. Algorithms have the same complexity a...

متن کامل

TRIANGULAR FUZZY MATRICES

In this paper, some elementary operations on triangular fuzzynumbers (TFNs) are defined. We also define some operations on triangularfuzzy matrices (TFMs) such as trace and triangular fuzzy determinant(TFD). Using elementary operations, some important properties of TFMs arepresented. The concept of adjoints on TFM is discussed and some of theirproperties are. Some special types of TFMs (e.g. pu...

متن کامل

Discovery of factors in binary data triangular decomposition of matrices

We present new methods of decomposition of an n ×m binary matrix I into a product A ∗ B of an n × k binary matrix A and a k×m binary matrix B. These decompositions are alternative to the usual one which is sought in Boolean factor analysis (BFA), where ∗ is a Boolean product of matrices. In the new decompositions, ∗ are the left and the right triangular products of Boolean matrices. In BFA, I i...

متن کامل

Determinants of Hankel Matrices

The purpose of this paper is to compute asymptotically Hankel determinants for weights that are supported in a semi-infinite interval. The main idea is to reduce the problem to determinants of other operators whose determinant asymptotics are well known.

متن کامل

On the Hankel-norm Approximation of Upper-triangular Operators and Matrices

A matrix T = Tij ∞ i,j=−∞, which consists of a doubly indexed collection fT ijg of operators, is said to be upper when Tij = 0 for i > j. We consider the case where the Tij are finite matrices and the operator T is bounded, and such that the Tij are generated by a strictly stable, non-stationary but linear dynamical state space model or colligation. For such a model, we consider model reduction...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 1971

ISSN: 0025-5718

DOI: 10.1090/s0025-5718-1971-0295553-0